Self-stabilizing robots in highly dynamic environments

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-stabilizing Robots in Highly Dynamic Environments

This paper deals with the classical problem of exploring a ring by a cohort of synchronous robots. We focus on the perpetual version of this problem in which it is required that each node of the ring is visited by a robot infinitely often. The challenge in this paper is twofold. First, we assume that the robots evolve in a highly dynamic ring, i.e., edges may appear and disappear unpredictably ...

متن کامل

Self-Stabilizing Scheduling Algorithm for Cooperating Robots

We address the problem of autonomous robots which alternate between execution of individual tasks and peer-to-peer communication. Each robot keeps in its permanent memory a set of locations where it can meet some of the other robots. The proposed self-stabilizing algorithm solves the management of visits to these locations ensuring that after the stabilizing phase, every visit to a location wil...

متن کامل

Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments

The first self-stabilizing algorithm [1] assumed the existence of a central daemon, that activates one processor at time to change state as a function of its own state and the state of a neighbor. Subsequent research has reconsidered this algorithm without the assumption of a central daemon, and under different forms of communication, such as the model of link registers. In all of these investi...

متن کامل

Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots

The Meeting problem for k ≥ 2 searchers in a polygon P (possibly with holes) consists in making the searchers move within P , according to a distributed algorithm, in such a way that at least two of them eventually come to see each other, regardless of their initial positions. The polygon is initially unknown to the searchers, and its edges obstruct both movement and vision. Depending on the sh...

متن کامل

Motion Planning and Obstacle Avoidance for Mobile Robots in Highly Cluttered Dynamic Environments

After a quarter century of mobile robot research, applications of this fascinating technology appear in real-world settings. Some require operation in environments that are densely cluttered with moving obstacles. Public mass exhibitions or conventions are examples of such challenging environments. This dissertation addresses the navigational challenges that arise in settings where mobile robot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2019

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2018.11.026